Convex polynomial approximation in Rd with Freud weights

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex polynomial approximation

Estimating the degree of approximation in the uniform norm, of a convex function on a finite interval, by convex algebraic polynomials, has received wide attention over the last twenty years. However, while much progress has been made especially in recent years by, among others, the authors of this article, separately and jointly, there have been left some interesting open questions. In this pa...

متن کامل

A Survey of Weighted Polynomial Approximation with Exponential Weights

Let W : R → (0, 1] be continuous. Bernstein’s approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm f → ‖fW‖L∞(R). The qualitative form of this problem was solved by Achieser, Mergelyan, and Pollard, in the 1950’s. Quantitative forms of the problem were actively investigated starting from the 1960’s. We survey old and recent aspects of this t...

متن کامل

Polynomial Approximation on Convex Subsets of Rn

Abstract. Let K be a closed bounded convex subset of Rn ; then by a result of the first author, which extends a classical theorem of Whitney there is a constantwm(K ) so that for every continuous function f on K there is a polynomial φ of degree at most m − 1 so that | f (x)− φ(x)| ≤ wm(K ) sup x,x+mh∈K |1h ( f ; x)|. The aim of this paper is to study the constant wm(K ) in terms of the dimensi...

متن کامل

Efficient estimation of neural weights by polynomial approximation

It has been known for some years that the uniformdensity problem for forward neural networks has a positive answer: Any real-valued, continuous function on a compact subset of R can be uniformly approximated by a sigmoidal neural network with one hidden layer. We design here algorithms for efficient uniform approximation by a certain class of neural networks with one hidden layer which we call ...

متن کامل

Full Quadrature Sums for Generalized Polynomials with Freud Weights

Generalized nonnegative polynomials are defined as products of nonnegative polynomials raised to positive real powers. The generalized degree can be defined in a natural way. In this paper we extend quadrature sums involving pth powers of polynomials to those for generalized polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 2015

ISSN: 0021-9045

DOI: 10.1016/j.jat.2014.11.004